Atoms and partial orders of infinite languages
نویسندگان
چکیده
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under ⊆. This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding. Mathematics Subject Classification. 68R15, 05C55.
منابع مشابه
Canonizable Partial Order Generators and Regular Slice Languages
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we focused on the study of Hasse diagram generators, i.e., slice graphs that generate only transitive reduced DAGs. In the present work we show that any slice graph can be transitive reduced into a Hasse diagram generator r...
متن کاملElectronic Behavior of Doped Graphene Nanoribbon Device: NEGF+DFT
Quantum transport properties of pure and functioned infinite lead-connection region-lead systembased on the zigzag graphene nanoribbon (2-zGNR) have been investigated. In this work the effectof the doping functionalization on the quantum transport of the 2-zGNR has been computationallystudied. Also, the effect of the imposed gate voltages (-3.0, 0.0 and +3.0 V) and bias voltages 0.0 to2.0 V hav...
متن کاملNew explicit and Soliton Wave Solutions of Some Nonlinear Partial Differential Equations with Infinite Series Method
To start with, having employed transformation wave, some nonlinear partial differential equations have been converted into an ODE. Then, using the infinite series method for equations with similar linear part, the researchers have earned the exact soliton solutions of the selected equations. It is required to state that the infinite series method is a well-organized method for obtaining exact s...
متن کاملHasse Diagram Generators and Petri Nets
In [18] Lorenz and Juhás raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets. Restricting ourselves to bounded p/t-nets, we propose Hasse diagram generators as an answer. We show that Hasse diagram generators are expressive enough to represent the partial order language of any bounded p/t net. We ...
متن کاملDegrees of Infinite Words, Polynomials, and Atoms (Extended Version)
We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite automata for recognising and transforming languages are well-understood, very little is known about the power of automata to transform infinite words. The word t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 35 شماره
صفحات -
تاریخ انتشار 2001